Reed–Muller Codes: Theory and Algorithms
نویسندگان
چکیده
Reed-Muller (RM) codes are among the oldest, simplest and perhaps most ubiquitous family of codes. They used in many areas coding theory both electrical engineering computer science. Yet, their important properties still under investigation. This paper covers some recent developments regarding weight enumerator capacity-achieving RM codes, as well algorithmic developments. In particular, discusses connections established between thresholds Boolean functions, polarization theory, hypercontractivity, techniques approximating low codewords using lower degree polynomials (when viewed evaluation vectors r m variables). It then overviews algorithms for decoding with provable performance guarantees every block length, state-of-the-art performances practical regimes, which do not perform large length. Finally, concludes a few open problems.
منابع مشابه
Codes and invariant theory
There is a beautiful analogy between most of the notions for lattices and codes and it seems to be quite promising to develop coding theory analogues of concepts known in the theory of lattices and modular forms and vice versa. Some of these analogies are presented in this short note that intends to survey recent developments connected to my talk Hecke-Operators for codes in Luminy, on May 9, 2...
متن کاملSuperimposed Codes and Query Algorithms
New superimposed codes based on finite projective planes are proposed. These codes allow to construct efficient randomized query algorithms for some functions.
متن کاملAlgebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases
In this paper, it is proved that any algehraicgeometr ic code can be expressed as a cross section of an extended multidimensional cyclic code. Both algebraic-geometric codes and multidimensional cyclic codes are descr ibed by a unified theory of l inear block codes def ined over point sets: algebraic-geometric codes are def ined over the points of an algebraic curve, and an m-dimensional cyclic...
متن کاملReed-Muller Codes: Spherically-Punctured Codes and Decoding Algorithms
OF THE DISSERTATION Reed-Muller Codes: Spherically-Punctured Codes and Decoding Algorithms
متن کاملHamming codes and some theory of linear error correcting codes
The topic is how to reduce the error of communication in the presence of noise. Block encoding is an expansion function from a block of plaintext alphabet symbols to a block of communication alphabet symbols where the block lengths are k and n respectively, and k ≤ n. Without loss of generality we consider both alphabets to be bit strings. The notation for an i length bit string is σ ∈ { 0, 1 }...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2021
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2020.3004749